A Resolution Method for Temporal Logic
نویسنده
چکیده
In this paper, a resolution method for propositional temporal logic is presented. Temporal formulae, incorporating both past-time and future-time temporal operators, are converted to Separated Normal Form (SNF), then both non-temporal and temporal resolution rules are applied. The resolution method is based on classical resolution, but incorporates a temporal resolution rule that can be implemented efficiently using a graph-theoretic approach.
منابع مشابه
An Improvement in Temporal Resolution of Seismic Data Using Logarithmic Time-frequency Transform Method
The improvement in the temporal resolution of seismic data is a critical issue in hydrocarbon exploration. It is important for obtaining more detailed structural and stratigraphic information. Many methods have been introduced to improve the vertical resolution of reflection seismic data. Each method has advantages and disadvantages which are due to the assumptions and theories governing their ...
متن کاملA Clausal Resolution Method for Extended Computation Tree Logic ECTL
A temporal clausal resolution method was originally developed for linear time temporal logic and further extended to the branching-time framework of Computation Tree Logic (CTL). In this paper, following our general idea to expand the applicability of this efficient method to more expressive formalisms useful in a variety of applications in computer science and AI requiring branching time logic...
متن کاملA clausal resolution method for CTL branching-time temporal logic
In this paper we extend our clausal resolution method for linear time temporal logics to a branching-time framework. Thus, we propose an e cient deductive method useful in a variety of applications requiring an expressive branching-time temporal logic in AI. The branching-time temporal logic considered is Computation Tree Logic (CTL), often regarded as the simplest useful logic of this class. T...
متن کاملA Resolution Method For CTL Branching-Time Temporal Logic
In this paper we extend our clausal resolution method for linear temporal logics to a branching-time framework. The branching-time temporal logics considered are Computation Tree Logic (CTL), often regarded as the simplest useful logic of this class, and Extended CTL (ECTL), which is CTL extended with fairness operators. The key elements of the resolution method, namely the normal form, the con...
متن کاملPropositional Temporal Proving with Reductions to a SAT Problem
We present a new approach to reasoning in propositional linear-time temporal logic (PLTL). The method is based on the simplified temporal resolution calculus. We prove that the search for premises to apply the rules of simplified temporal resolution can be re-formulated as a search for minimal unsatisfiable subsets (MUS) in a set of classical propositional clauses. This reformulation reduces a ...
متن کامل